A new class of balanced search trees : half-balanced binary search tress

A New Class of Balanced Search Trees: Half Balanced Binary Search Trees

— A newclassojbalancedbinary search trees is introduced: thehalf-balancedbinary trees. When used as a node search tree, a hal]-balanced binary tree containing n keys has a height at most 2 lg(n + 2) —2. Algorithms are given for IN SERT and DELETE instructions, having time complexity O(lg n). A remarkable resuit is that at most one local restructuring must be performed during the (leletion or th...

Balanced Binary Search Trees

University of Southern Denmark 10.

Simple Balanced Binary Search Trees

Efficient implementations of sets and maps (dictionaries) are important in computer science, and balanced binary search trees are the basis of the best practical implementations. Pedagogically, however, they are often quite complicated, especially with respect to deletion. I present complete code (with justification and analysis not previously available in the literature) for a purely-functiona...

A New Weight Balanced Binary Search Tree

Balanced Search Trees Made